Subsequences of Standard Special Circular Sequences in E 2
نویسندگان
چکیده
It is known that a standard special circular sequence in E2 T properly defines a special polygon. We are interested in a part of such a sequence. It is shown that if the first point and the last point of the subsequence are different, it becomes a special polygonal sequence. The concept of “a part of” is introduced, and the subsequence having this property can be characterized by using “mid” function. For such subsequences, the concepts of “Upper” and “Lower” parts are introduced.
منابع مشابه
Subsequences of Standard Special Circular Sequences in E 2 T
properly defines a special polygon. We are interested in a part of such a sequence. It is shown that if the first point and the last point of the subsequence are different, it becomes a special polygonal sequence. The concept of „a part of” is introduced, and the subsequence having this property can be characterized by using „mid” function. For such subsequences, the concepts of „Upper” and „Lo...
متن کاملMining Biological Repetitive Sequences Using Support Vector Machines and Fuzzy SVM
Structural repetitive subsequences are most important portion of biological sequences, which play crucial roles on corresponding sequence’s fold and functionality. Biggest class of the repetitive subsequences is “Transposable Elements” which has its own sub-classes upon contexts’ structures. Many researches have been performed to criticality determine the structure and function of repetitiv...
متن کاملFinding Exact and Solo LTR-Retrotransposons in Biological Sequences Using SVM
Finding repetitive subsequences in genome is a challengeable problem in bioinformatics research area. A lot of approaches have been proposed to solve the problem, which could be divided to library base and de novo methods. The library base methods use predetermined repetitive genome’s subsequences, where library-less methods attempt to discover repetitive subsequences by analytical approach...
متن کاملCluster Points of Subsequences
In the preceding paper [ l ] 2 Buck defines a class of "subsequences" of a multiple sequence and shows that "almost all" of such subsequences have certain properties. This note is essentially based on a different choice of the definition of "subsequences" ; that is, this paper and [ l ] are generalizations in different directions of a preceding paper by Buck and Pollard (reference 2 of [l ]). I...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997